/*
Problem Id:2681  User Id:Latex 
Memory:44K  Time:140MS
Language:G++  Result:Accepted

Source 
*/
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>

	char	st[2][80];
	int  	n;
	int		ind[2][30];
	int		Ncase, ct;

main()
{
	int		i, j, k;
	int 	l;
	int 	dif;
	
	scanf("%ld\n", &Ncase);
	
	for (ct=1; ct<=Ncase; ct++)
	{
		gets(st[0]);
		gets(st[1]);
		memset(ind, 0, sizeof(ind));
		for (i=0; i<2; i++)
		{
			l = strlen(st[i]);
			for (j=0; j<l; j++)
				if (st[i][j] >= 'a' && st[i][j] <= 'z')
					ind[i][ st[i][j] - 'a']++;
		}
		dif = 0;
		for (i=0; i<26; i++)
			dif += abs(ind[0][i] - ind[1][i]);
		printf("Case #%ld:  %ld\n", ct, dif);
	}
	return 0;
}

